Periodic Sweep Coverage Scheme Based on Periodic Vehicle Routing Problem

نویسندگان

  • Li Shu
  • Ke-wei Cheng
  • Xiaowen Zhang
  • Jiliu Zhou
چکیده

We provide a sweep coverage algorithm for routing mobile sensors that communicate with a central data sink. This algorithm improves on its predecessors by reducing the number of unnecessary scans when different points of interest (POIs) have different requirements for the time interval within which they must be scanned (sweep period). Most sweep coverage algorithms seek to minimize the number of sensors required to cover a given collection of POIs. When POIs have different sweep period requirements, existing algorithms will produce solutions in which sensors visit some POIs much more frequently than is necessary. We define this as the POI Over-Coverage problem. In order to address this problem we develop a Periodic Sweep Coverage (PSC) scheme based on a well-known solution to the Periodic Vehicle Routing Problem (PVRP). Our algorithm seeks a route for the mobile sensors that minimizes the number of unnecessary visits to each POI. To verify and test the proposed scheme we implemented a C++ simulation and ran scenarios with a variety of POI topologies (number and distribution of the POIs) and the speed at which sensors could travel. The simulation results show that the PSC algorithm outperforms other sweep coverage algorithms such as CSweep and Vehicle Routing Problem Sweep Coverage (VRPSC) on both the average number of sensors in a solution and in the computational time required to find a solution. Our results also demonstrate that the PSC scheme is more suitable for the sweep coverage scenarios in which higher speed mobile sensors are used.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation

In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...

متن کامل

a swift heuristic algorithm base on data mining approach for the Periodic Vehicle Routing Problem: data mining approach

periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. This paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (PVRP). The related results of proposed algorithm are compared with the resu...

متن کامل

A New Competitive Approach on Multi-Objective Periodic Vehicle Routing Problem

This paper presents a novel multi-objective mathematical model of a periodic vehicle routing problem (PVRP) in a competitive situation for obtaining more sales. In such a situation, the reaching time to customers affects the sale amount therefore, distributors intend to service customers earlier than other rivals for obtaining the maximum sale. Moreover, a partial driver’s benefit is related...

متن کامل

A Sweep Coverage Scheme Based on Vehicle Routing Problem

As an emerging coverage problem in wireless sensor networks, sweep coverage which introducing mobile sensors to cover points of interest within certain time interval can satisfy monitoring request in some particular application scenarios with less number of nodes than the conventional static coverage approach. In this work, aiming to support dynamical POI coverage and data delivery simultaneous...

متن کامل

THE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS

The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JNW

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2014